package BC96_有序序列判断;

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] a = new int[n];
        for (int i = 0; i < n; i++){
            a[i] = sc.nextInt();
        }

        if (a[0] > a[1]){
            int i = 0;
            for (; i < n - 1; i++){
                if (a[i] < a[i + 1]){
                    break;
                }
            }
            if (i == n - 1){
                System.out.println("sorted");
            }else {
                System.out.println("unsorted");
            }
        }else {
            int i = 0;
            for (; i < n - 1; i++){
                if (a[i] > a[i + 1]){
                    break;
                }
            }
            if (i == n - 1){
                System.out.println("sorted");
            }else {
                System.out.println("unsorted");
            }
        }
    }
}
